Pushdown automaton

Results: 134



#Item
111Automata and Complexity in Multiple-Quantifier Sentence Verification Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Shane Steinert-Threlkeld (Shanest@stanford.

Automata and Complexity in Multiple-Quantifier Sentence Verification Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Shane Steinert-Threlkeld (Shanest@stanford.

Add to Reading List

Source URL: jakubszymanik.com

Language: English - Date: 2013-05-20 06:27:06
112Probabilistic semantic automata in the verification of quantified statements Jakub Dotlaˇcil ([removed]) Center for Language and Cognition, University of Groningen Jakub Szymanik ([removed]) In

Probabilistic semantic automata in the verification of quantified statements Jakub Dotlaˇcil ([removed]) Center for Language and Cognition, University of Groningen Jakub Szymanik ([removed]) In

Add to Reading List

Source URL: jakubszymanik.com

Language: English - Date: 2014-04-30 09:18:26
113Pushdown Control-Flow Analysis of Higher-Order Programs Christopher Earl David Van Horn ∗  Matthew Might

Pushdown Control-Flow Analysis of Higher-Order Programs Christopher Earl David Van Horn ∗ Matthew Might

Add to Reading List

Source URL: matt.might.net

Language: English - Date: 2014-01-06 09:40:03
114Deterministic Pushdown Automata  237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if

Deterministic Pushdown Automata 237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if

Add to Reading List

Source URL: www.cs.uiuc.edu

Language: English - Date: 2005-10-18 14:54:39
115EPDA Taking the next step with Easysite Case Study  Background

EPDA Taking the next step with Easysite Case Study Background

Add to Reading List

Source URL: www.easysitecms.net

Language: English - Date: 2012-11-06 11:18:43
1161  Book Title Book Editors IOS Press, 2003

1 Book Title Book Editors IOS Press, 2003

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:50:25
117Deciding DPDA Equivalence is Primitive Recursive Colin Stirling

Deciding DPDA Equivalence is Primitive Recursive Colin Stirling

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:52:43
118Language Theory and Innite Graphs Colin Stirling S
hool of Informati
s

Language Theory and In nite Graphs Colin Stirling S hool of Informati s

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:50:17
119Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK

Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-05-20 09:59:44
1201  Language Theory and Infinite Graphs

1 Language Theory and Infinite Graphs

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-02-02 08:38:30